Alternate Sylvester sums on the Frobenius set
نویسندگان
چکیده
The alternate Sylvester sums are Tm(a, b) = ∑ n∈NR(−1)n, where a and b are coprime, positive integers, and NR is the Frobenius set associated with a and b. In this note, we study the generating functions, recurrences and explicit expressions of the alternate Sylvester sums. It can be found that the results are closely related to the Bernoulli polynomials, the Euler polynomials, and the (alternate) power sums over the natural numbers.
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملAn extension of the Frobenius coin - exchange problem
Given a set of positive integers A = {a1, . . . , ad} with gcd(a1, . . . , ad) = 1, we call an integer n representable if there exist nonnegative integers m1, . . . ,md such that n = m1a1 + · · ·+mdad . In this paper, we discuss the linear diophantine problem of Frobenius: namely, find the largest integer which is not representable. We call this largest integer the Frobenius number g(a1, . . . ...
متن کاملOn some Frobenius groups with the same prime graph as the almost simple group ${ {bf PGL(2,49)}}$
The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime gr...
متن کاملExact Properties of Frobenius Numbers and Fraction of the Symmetric Semigroups in the Weak Limit for N=3
We generalize and prove a hypothesis by V. Arnold on the parity of Frobenius number. For the case of symmetric semigroups with three generators of Frobenius numbers we found an exact formula, which in a sense is the sum of two Sylvester’s formulaes. We prove that the fraction of the symmetric semigroups is vanishing in the weak limit. 1. Definitions Take n mutually prime numbers a1, a2, ..., an...
متن کاملAn Iterative Algorithm for the Generalized Reflexive Solutions of the Generalized Coupled Sylvester Matrix Equations
An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 56 شماره
صفحات -
تاریخ انتشار 2008